Speeding Up Computers
نویسندگان
چکیده
For over thirty years until 2004-5 the speed of processors followed the Moore’s Law and was exponentially increasing. Approximately every 18 months processors speed doubled. This rapid and steady progress was very economically satisfying. It was enough to wait several months for new processor generation without the need for redeveloping software. However shortly after the electronic technology hit energy consumption and heat dissipation walls in the middle of the new century first decade we witnessed the appearance of multi-core processors. Initially with two or four cores. Later up to eight. The growth of processor speed continued but the technology behind the increased performance was parallelism not the higher clock frequency. A more dramatic change took place when NVIDIA and AMD designed and manufactured highly parallel processing devices with many cores. Initially they were used mainly for graphics applications and called Graphics Processing Units (GPU). Later they have become useful for general purpose applications (GPGPU) beyond graphics and visualization [Kirk2010, Sanders2011].
منابع مشابه
Speeding up computations via molecular biology
We show how to extend the recent result of Adleman 1] to use biological experiments to directly solve any NP problem. We, then, show how to use this method to speedup a large class of important problems.
متن کاملSpeeding up the Stress Analysis of Hollow Circular FGM Cylinders by Parallel Finite Element Method
In this article, a parallel computer program is implemented, based on Finite Element Method, to speed up the analysis of hollow circular cylinders, made from Functionally Graded Materials (FGMs). FGMs are inhomogeneous materials, which their composition gradually varies over volume. In parallel processing, an algorithm is first divided to independent tasks, which may use individual or shared da...
متن کاملCase studies in determining the optimal field programmable gate array design for computing highly parallelisable problems
Reconfigurable hardware has recently shown itself to be an appropriate solution to speeding up problems that are highly dependent on a particular complex or repetitive sub-algorithm. In most cases, these types of solutions lend themselves well to parallel solutions. The optimal design on field programmable gate arrays (FPGAs) for problems with algorithms or sub-algorithms that can be highly par...
متن کاملApproximate Search for Big Data with Applications in Information Security – a Survey
Abstract: This paper is a survey of approximate search techniques in very large data sets (so-called Big Data). After a short introduction, some techniques for speeding up approximate search in such data sets based on exploitation of inherent bit-parallelism in computers are described. It then reviews the applications in search related to information security problems (digital forensics, malwar...
متن کاملImproving network security using genetic algorithm approach
With the expansion of Internet and its importance, the types and number of the attacks have also grown making intrusion detection an increasingly important technique. In this work we have realized a misuse detection system based on genetic algorithm (GA) approach. For evolving and testing new rules for intrusion detection the KDD99Cup training and testing dataset were used. To be able to proces...
متن کاملParallel Polygon Scan Conversion on RMESH Multiprocessors
Polygon scan conversion is an important operation in computer graphics application. Speeding up this operation makes the animation more realistic. In this paper, we present a parallel algorithm to scan convert a polygon from its object space representation into its image space representation using RMESH multiprocessors. The total number of SIMD RMESH processors is N N × , where each processor e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1603.05487 شماره
صفحات -
تاریخ انتشار 2016